Turing machine - PDFSEARCH.IO - Document Search Engine

Turing machine
Results: 564

#	Item
251	CHAPTER THREE PERCEPTION AND COMPUTATION In this chapter we indicate how the class of observers properly contains the class of Turing machines. We discuss the simulation of observers by Turing Add to Reading List Source URL: www.cogsci.uci.edu Language: English - Date: 2002-07-26 13:45:30 Theory of computation Computer science Models of computation Formal methods Alan Turing Symbol Computable function Turing machine Turing degree Computability theory Theoretical computer science Mathematics
252	Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-12-03 20:27:51 Turing machine Models of computation Mathematical optimization Structural complexity theory Computational complexity theory NP P versus NP problem Reduction P-complete Theoretical computer science Applied mathematics Complexity classes
253	Foundations of Software Technology and Theoretical Computer Science (Bangalore[removed]Editors: R. Hariharan, M. Mukund, V. Vinay; pp[removed]The Complexity of Tree Transducer Output Languages Kazuhiro Inaba1 and Sebastia Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2009-11-17 09:02:18 Computer science Binary tree Computation tree Symbol Finite-state machine Non-deterministic Turing machine Automata theory Theoretical computer science Models of computation
254	A paradox related to the Turing Test Samuel A. Alexander∗ Department of Mathematics, the Ohio State University Published in The Reasoner vol. 5, issue 6, p. 90. I will describe a paradox which arises assuming it is pos Add to Reading List Source URL: www.semitrivial.com Language: English - Date: 2012-07-26 20:25:00 Computer science Alan Turing Formal methods Models of computation Computable function Turing machine Computability Turing test Computable number Computability theory Theoretical computer science Theory of computation
255	Samuel A. Alexander Research Statement 1 Applications of Mathematics to Theoretical Computer Science 1.1 Knowing machines . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 A machine that knows its own code . . . Add to Reading List Source URL: www.semitrivial.com Language: English - Date: 2014-01-16 13:36:26 Logic Ordinal numbers Theory of computation Turing jump Recursively enumerable set Proof theory Ordinal arithmetic Enumeration Algorithm Mathematical logic Mathematics Computability theory
256	Manuscript draft Nov.29, 2007 The Neural Net of the Tapeworm Turingium universalis (Wolfram) Erwin Engeler, ETH Zurich, Switzerland T.universalis, was first described by Wolfram in Campaign, Illinois, U.S.A. and by Smith Add to Reading List Source URL: www.math.ethz.ch Language: English - Date: 2008-01-30 08:09:30 Mind Neuroscience Computational neuroscience Neuron Neural network Alan Turing Turing machine Science Nervous system
257	Beyond the Turing Test Concluding that there is no one test for machine intelligence, AI researchers develop a battery of research challenges By Jia You A Add to Reading List Source URL: vision.stanford.edu Language: English - Date: 2015-01-11 14:58:07 British people Philosophy of artificial intelligence Human–computer interaction Turing test Turing Turing machine Science Artificial intelligence Alan Turing
258	OVERLOAD CONTENTS OVERLOAD 117 October 2013 Add to Reading List Source URL: accu.org Language: English - Date: 2013-10-09 08:38:21 Software architecture Theoretical computer science Turing machine Formal methods Cohesion Coupling Algorithm Source lines of code Alan Turing Software engineering Software metrics Computing
259	Bounded Memory Protocols Max Kanovich1 , Tajana Ban Kirigin2 , Vivek Nigam3 , Andre Scedrov4 Abstract It is well-known that the Dolev-Yao adversary is a powerful adversary. Besides acting as the network, intercepting, de Add to Reading List Source URL: bib.irb.hr Language: English - Date: 2014-08-21 13:21:17 Computing Cryptography Communications protocol Adversary model Cryptographic nonce Turing machine Memory Bounded set Cryptographic protocols Data Information
260	Bounded memory Dolev-Yao adversaries in collaborative systems Max Kanovich1 , Tajana Ban Kirigin2 , Vivek Nigam3 , and Andre Scedrov3 1 Queen Mary, University of London, UK Add to Reading List Source URL: bib.irb.hr Language: English - Date: 2010-09-30 13:57:08 Theory of computation Models of computation PSPACE-complete Non-deterministic Turing machine Cryptographic nonce Configuration Theoretical computer science Turing machine Applied mathematics

UPDATE